Reliable Reductions High Sets and Low Sets
نویسندگان
چکیده
Measuring the information content of a set by the space bounded Kolmogorov complexity of its characteristic sequence we investigate the non uniform com plexity of sets A in EXPSPACE poly that reduce to some set having very high information content Speci cally we show that if the reducibility used has a certain property called reliability then A in fact is reducible to a sparse set under the same reducibility As a consequence the existence of hard sets under reliable reducibilities of very high information content is unlikely for various complexity classes as for example NP PP and PSPACE
منابع مشابه
پاسخ ویسفاتین و شاخص مقاومت به انسولین به پروتکلهای مختلف فعالیت مقاومتی
Background: The aim of this study was to compare responses of Visfatin and insulin resistance index to various resistance exercise protocols. Methods: Ten healthy male subjects performed three resistance exercise protocols including maximal strength (three sets of 5 repetition at 85% of 1-RM with 3-min rest between sets), hyperthrophy (three sets of 10 repetition at 70% of 1-RM with 2-min rest...
متن کاملHausdor Reductions to Sparse Sets and toSets of High Information
We investigate the complexity of sets that have a rich internal structure and at the same time are reducible to sets of either low or very high information content. In particular, we show that every length-decreasing or word-decreasing self-reducible set that reduces to some sparse set via a non-monotone variant of the Hausdorr reducibility is low for p 2. Measuring the information content of a...
متن کاملFeature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach
Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...
متن کاملReductions to Sets of Low Information Content
In this paper we study the complexity of sets that reduce to sparse sets (and tally sets), and the complexity of the simplest sparse sets to which such sets reduce. We show even with respect to very exible reductions that NP cannot have sparse hard sets unless P = NP; an immediate consequence of our results is: If any NP-complete set conjunctively reduces to a sparse set, then P = NP. We also s...
متن کاملThe Amount of Meritocracy Establishment Using Rough Sets Theory
The amount of meritocracy system establishment in the government agencies of Ahvaz is assessed in this study. Meritocracy is a system in which the job benefits and situations are given to the people just on the basis of merit and not based on the gender, social class, ethnicity or wealth. Statistical society is the employers of government organizations of Ahvaz (N=10377) and the volume of sampl...
متن کامل